/**
 * created the 27 sept. 07
 */
package choco.global.scheduling.trees;
import choco.global.scheduling.trees.abstrees.AbstractNodeInfo;
import choco.global.scheduling.trees.abstrees.AbstractThetaTree;
import choco.integer.IntDomainVar;

/**
 * The Theta tree is used in the rules NF/NL, detectable precedence and overload checking of the disjunctive constraints.
 * @author Arnaud Malapert (arnaud.malapert@emn.fr)
 *
 */
public class DisjTreeT extends AbstractThetaTree {

	public DisjTreeT(IntDomainVar[] vars, int[] processingTimes,boolean ectOrLst) {
		super(vars, processingTimes, ectOrLst);
	}

	@Override
	protected AbstractNodeInfo createEmptyNodeInfo() {
		return new DisjNodeInfoT();
	}
	/**
	 * get the theta time of the root node
	 * @return the time for this type of tree
	 */
	public int getTime() {
		return root.infos.getIntValue(0);
	}

	/**
	 * get the theta consumption of the root node
	 * @return the consumption for this type of tree
	 */
	public int getConsumption() {
		return root.infos.getIntValue(1);
		
	}



}
